A computer-aided analysis of some finitely presented groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distortion of Wreath Products in Some Finitely Presented Groups

Wreath products such as Z ≀ Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z ≀ Z as a subgroup of Thompson’s group F and as a subgroup of Baumslag’s metabelian group G. We find that Z ≀ Z is undistorted in F but is at least exponentially distorted in G.

متن کامل

A Characterisation of Large Finitely Presented Groups

In this paper, we will consider finitely presented groups that have a finite index subgroup which admits a surjective homomorphism onto a non-abelian free group. Gromov called these groups large [4]. Large groups have particularly nice properties (for example, super-exponential subgroup growth). They also play an important rôle in lowdimensional topology: it is a major conjecture that the funda...

متن کامل

Finitely Presented Residually Free Groups

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...

متن کامل

Constructing Matrix Representations of Finitely Presented Groups

The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...

متن کامل

Decompositions of finitely generated and finitely presented groups

In this paper we discuss the splitting or decomposing of finitely generated groups into free products, free products with amalgamation or HNN extensions and we discuss the JSJ decomposition of finitely presented groups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1992

ISSN: 0263-6115

DOI: 10.1017/s1446788700036533